Community detection using boundary nodes in complex networks

We propose a new local community detection algorithm, which finds communities by identifying borderlines between them using boundary nodes. We apply a modified version of label propagation for community detection that uses the number of common neighbors for deciding community label of each node. Our algorithm is fast and finds communities accurately. It outperforms other algorithms especially when the community structure is subtle. It is possible to scale the algorithm in parallel systems.